Optimized Artificial Bee Colony Algorithm for Web Service Composition Problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimized Artificial Bee Colony Algorithm for Clustering

K-means algorithm is sensitive to initial cluster centers and its solutions are apt to be trapped in local optimums. In order to solve these problems, we propose an optimized artificial bee colony algorithm for clustering. The proposed method first obtains optimized sources by improving the selection of the initial clustering centers; then, uses a novel dynamic local optimization strategy utili...

متن کامل

Elite Opposition-based Artificial Bee Colony Algorithm for Global Optimization

 Numerous problems in engineering and science can be converted into optimization problems. Artificial bee colony (ABC) algorithm is a newly developed stochastic optimization algorithm and has been widely used in many areas. However, due to the stochastic characteristics of its solution search equation, the traditional ABC algorithm often suffers from poor exploitation. Aiming at this weakness o...

متن کامل

Modified Artificial Bee Colony Algorithm for Solving Economic Dispatch Problem

A Modified Artificial Bee Colony (ABC) algorithm for Economic Dispatch (ED) problem has been proposed. The Artificial Bee Colony (ABC) algorithm which is inspired by the foraging behavior of honey bee swarm gives a solution procedure for solving economic dispatch problem. It provides solution more effective than Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Ant Colony Optimizati...

متن کامل

A Discrete Artificial Bee Colony Algorithm for TSP Problem

In this paper, a new discrete artificial bee colony algorithm is used to solve the symmetric traveling salesman problem (TSP). The concept of Swap Operator has been introduced to the original artificial bee colony (ABC) algorithm which can help the bees to generate a better candidate tour by greedy selection. By taken six typical TSP instances as examples, the proposed algorithm is compared wit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Machine Learning and Computing

سال: 2021

ISSN: ['2010-3700']

DOI: https://doi.org/10.18178/ijmlc.2021.11.5.1056